Delay-Optimal Scheduling for Queueing Systems with Switching Overhead
نویسندگان
چکیده
We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to serve a different set of queues. The capacity loss due to this switching overhead can be significant in many emerging applications, and needs to be explicitly addressed in the design of scheduling policies. For example, in 60GHz wireless networks with directional antennas, base stations need to train and reconfigure their beam patterns whenever they switch from one client to another. Considerable switching overhead can also be observed in many other queueing systems such as transportation networks and manufacturing systems. While the celebrated Max-Weight policy achieves asymptotically optimal average delay for systems without switching overhead, it fails to preserve throughput-optimality, let alone delay-optimality, when switching overhead is taken into account. We propose a class of Biased Max-Weight scheduling policies that explicitly takes switching overhead into account. The Biased Max-Weight policy can use either queue length or head-of-line waiting time as an indicator of the system status. We prove that our policies not only are throughput-optimal, but also can be made arbitrarily close to the asymptotic lower bound on average delay. To validate the performance of the proposed policies, we provide extensive simulation with various system topologies and different traffic patterns. We show that the proposed policies indeed achieve much better delay performance than that of the state-of-theart policy.
منابع مشابه
Distributed Queueing in Scalable High Performance Routers
This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar objective to crossbar-scheduling mechanisms used in routers with relatively small port counts, and shares some common high level characteristics. However, the need to minimize communication overhead rules out the iterati...
متن کاملOn service guarantees of fair-queueing schedulers in real systems
In most systems, fair-queueing packet schedulers are the algorithms of choice for providing bandwidth and delay guarantees. These guarantees are computed assuming that the scheduler is directly attached to the transmit unit with no interposed buffering, and, for timestamp-based schedulers, that the exact number of bits transmitted is known when timestamps need to be updated. Unfortunately, both...
متن کاملIncentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay and other Delaying Tactics
How should a capacity-constrained firm design an incentive-compatible price-scheduling mechanism to maximize revenues from a heterogeneous pool of time-sensitive customers with private information on their willingness to pay, time-sensitivity and processing requirement? We consider this question in the context of a queueing system that serves two customer types. We provide the following insight...
متن کاملYin Sun
In modern computer systems, long-running jobs are divided into a large number of short tasks and executed in parallel. As the system size and complexity scales up, the task service times become highly random and the job service time is constrained by the slowest straggling tasks. An efficient solution is to replicate a task on multiple servers and wait for one task copy to finish early. However...
متن کاملApproximate Analysis of a Round Robin Scheduling Scheme for Network Coding
Network coding (NC) has been proposed as a way to compress flows of packets by combining different packets, provided that there is sufficient redundancy through multiple transmission paths so that the receiving nodes can then decode the flows to reconstruct all of the individual packets. However NC does introduce additional computational overhead, and also creates different additional delays wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1701.03831 شماره
صفحات -
تاریخ انتشار 2017